Comparing the Expressive Power of Well-Structured Transition Systems
نویسندگان
چکیده
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewriting systems. For each one of these models we study the class of languages generated by labelled transition systems describing their semantics. We consider here two types of accepting conditions: coverability and reachability of a given configuration. In both cases we obtain a strict hierarchy in which constrained multiset rewriting systems is the the most expressive model.
منابع مشابه
A classification of the expressive power of well-structured transition systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, constrained multiset rewriting systems, and data nets. For each one of these models we study the class of languages generated by labelled transition systems describing their semantics. We consider here two types of accepting conditions: coverabil...
متن کاملLanguage-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-t...
متن کاملOn the coverability and reachability languages of monotonic extensions of Petri nets
We apply language theory to compare the expressive power of infinite-state models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets in which tokens carry pure names dynamically generated with special ν-transitions (νPN) and compare their expressiveness with transfer and reset nets with black indistinguishab...
متن کاملA theory for comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. While such comparisons are generally based on simulations between different access control schemes, the definitions for simulations that are used in the literature are informal, and make it impossible to put results and claims about the expressive power of access control models i...
متن کاملA theory for comparing the expressive power of access control models 1
We present a theory for comparing the expressive power of access control models. The theory is based on simulations that preserve security properties. We perceive access control systems as state-transition systems and present two kinds of simulations, reductions and state-matching reductions. In applying the theory, we highlight four new results and discuss these results in the context of other...
متن کامل